A Boolean Function Requiring 3n Network Size
نویسنده
چکیده
Paul [ PJ first proved a 2.Sn-Iower bound for the network complex ity of an explicit boole an function. We mo dify the defi n ition of Pa ul's func tion a little a nd prove a 3n-I ower bound for th e network complexity of that function.-1
منابع مشابه
New upper bounds on the Boolean circuit complexity of symmetric functions
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric function of n variables, as well as circuits of size 3n for MOD3 function.
متن کاملcient Digital to Analog Encoding
An important issue in analog circuit design is the problem of digital to analog conversion, namely, the encoding of Boolean variables into a single analog value which contains enough information to reconstruct the values of the Boolean variables. A natural question is: What is the complexity of implementing the digital to analog encoding function? That question was recently answered in 5], wher...
متن کاملEfficient digital-to-analog encoding
An important issue in analog circuit design is the problem of digital-to-analog conversion, i.e., the encoding of Boolean variables into a single analog value which contains enough information to reconstruct the values of the Boolean variables. A natural question is: What is the complexity of implementing the digital-to-analog encoding function? That question was recently answered by Wegener, w...
متن کاملCorrelation Bounds and #SAT Algorithms for Small Linear-Size Circuits
We revisit the gate elimination method, generalize it to prove correlation bounds of boolean circuits with Parity, and also derive deterministic #SAT algorithms for small linear-size circuits. In particular, we prove that, for boolean circuits of size 3n − n, the correlation with Parity is at most 2−n Ω(1) , and there is a #SAT algorithm running in time 2n−n Ω(1) ; for circuit size 2.99n, the c...
متن کاملPeriodic Symmetric Functions with Feed-Forward Neural Networks
This technical report presents a new theoretical approach to the problem of switching networks synthesis with McCulloch-Pitts feed-forward neural networks. It is shown that any n-inputs periodical symmetric Boolean function Fp with the period T and the first positive transition at x = a can be implemented with a 1 + dlog n a T e depth and size network both measured in term of neurons, when a pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 28 شماره
صفحات -
تاریخ انتشار 1984